Factoring polynomials over p-adic elds
نویسنده
چکیده
We give an eecient algorithm for factoring polynomials over nite algebraic extensions of the p-adic numbers. This algorithm uses ideas of Chistov's random polynomial-time algorithm, and is suitable for practical implementation.
منابع مشابه
Factoring Polynominals over p-Adic Fields
We give an efficient algorithm for factoring polynomials over finite algebraic extensions of the p-adic numbers. This algorithm uses ideas of Chistov’s random polynomial-time algorithm, and is suitable for practical implementation.
متن کاملZero testing of p-adic and modular polynomials
We obtain new algorithms for testing whether a given by a black box multivariate polynomial over p-adic elds given by a black box is identical to zero. We also remark on the zero testing of polynomials in residue rings. Our results complement a known results on the zero testing of polynomials over the integers, the rationals, and over nite elds. c © 2000 Elsevier Science B.V. All rights reserved.
متن کاملFactoring Polynomials over Finite Fields: Asymptotic Complexity vs. Reality
Several algorithms for factoring polynomials over nite elds are compared from the point of view of asymptotic complexity, and from a more realistic point of view: how well actual implementations perform on \moderately" sized inputs.
متن کاملThe Complete Analysis of a Polynomial Factorization Algorithm over Nite Elds the Complete Analysis of a Polynomial Factorization Algorithm over Nite Elds the Complete Analysis of a Polynomial Factorization Algorithm over Finite Fields
A uniied treatment of parameters relevant to factoring polynomials over nite elds is given. The framework is based on generating functions for describing parameters of interest and on singularity analysis for extracting asymptotic values. An outcome is a complete analysis of the standard polynomial factorization chain that is based on elimination of repeated factors, distinct degree factorizati...
متن کاملFactoring Polynomials over Special Finite Fields
We exhibit a deterministic algorithm for factoring polynomials in one variable over "nite "elds. It is e$cient only if a positive integer k is known for which ' k (p) is built up from small prime factors; here ' k denotes the kth cyclotomic polynomial, and p is the characteristic of the "eld. In the case k"1, when ' k (p)"p!1, such an algorithm was known, and its analysis required the generaliz...
متن کامل